منابع مشابه
Computing 3D Periodic Triangulations
This work is motivated by the need for software computing 3D periodic triangulations in numerous domains including astronomy, material engineering, biomedical computing, fluid dynamics etc. We design an algorithmic test to check whether a partition of the 3D flat torus actually forms a triangulation (which subsumes that it is a simplicial complex). We propose an incremental algorithm that compu...
متن کاملCounting triangulations and pseudo-triangulations of wheels
Motivated by several open questions on triangulations and pseudotriangulations, we give closed form expressions for the number of triangulations and the number of minimum pseudo-triangulations of n points in wheel configurations, that is, with n − 1 in convex position. Although the numbers of triangulations and pseudotriangulations vary depending on the placement of the interior point, their di...
متن کاملCanonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-line Drawings
We extend the notion of canonical orderings to cylindric triangulations. This allows us to extend the incremental straight-line drawing algorithm of de Fraysseix, Pach and Pollack to this setting. Our algorithm yields in linear time a crossing-free straight-line drawing of a cylindric triangulation G with n vertices on a regular grid Z/wZ× [0..h], with w ≤ 2n and h ≤ n(2d+1), where d is the (gr...
متن کاملCanonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings
We extend the notion of canonical orderings to cylindric triangulations. This allows us to extend the incremental straight-line drawing algorithm of de Fraysseix, Pach and Pollack to this setting. Our algorithm yields in linear time a crossing-free straight-line drawing of a cylindric triangulation G with n vertices on a regular grid Z/wZ× [0..h], with w ≤ 2n and h ≤ n(2d+1), where d is the (gr...
متن کاملNonregular Triangulations, View Graphs of Triangulations, and Linear Programming Duality
For a triangulation and a point, we de ne a directed graph representing the order of the maximal dimensional simplices in the triangulation viewed from the point. We prove that triangulations having a cycle the reverse of which is not a cycle in this graph viewed from some point are forming a (proper) subclass of nonregular triangulations. We use linear programming duality to investigate furthe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/8298